Tree Checking for Sparse Complexes
نویسندگان
چکیده
We detail here the sparse variant of the algorithm sketched in [2] for checking if a simplicial complex is a tree. A full worst case complexity analysis is given and several optimizations are discussed. The practical complexity is discussed for some examples.
منابع مشابه
A Total Ratio of Vegetation Index (TRVI) for Shrubs Sparse Cover Delineating in Open Woodland
Persian juniper and Pistachio are grown in low density in the rangelands of North-East of Iran. These rangelands are populated by evergreen conifers, which are widespread and present at low-density and sparse shrub of pistachio in Iran, that are not only environmentally but also genetically essential as seed sources for pistachio improvement in orchards. Rangelands offer excellent opportunities...
متن کاملCurrent Trends and New Perspectives for First-Order Model Checking (Invited Talk)
The model-checking problem for a logic L is the problem of decidig for a given formula φ ∈ L and structure A whether the formula is true in the structure, i.e. whether A |= φ. Model-checking for logics such as First-Order Logic (FO) or Monadic Second-Order Logic (MSO) has been studied intensively in the literature, especially in the context of algorithmic meta-theorems within the framework of p...
متن کاملProbabilistic Arc Consistency
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full arc consistency while FC maintains a limited form of arc consistency during search. Previous work has shown that there is no single champion algorithm: MAC is more efficient on sparse problems which are tightly constrai...
متن کاملParameterized complexity of distances to sparse graph classes
This dissertation offers contributions to the area of parameterized complexity theory, which studies the complexity of computational problems in a multivariate framework. We demonstrate that for graph problems, many popular parameters can be understood as distances that measure how far a graph is from belonging to a class of sparse graphs. We introduce the term distance parameter for such param...
متن کاملSMT-Based Checking of SOLOIST over Sparse Traces
SMT solvers have been recently applied to bounded model checking and satisfiability checking of metric temporal logic. In this paper we consider SOLOIST, an extension of metric temporal logic with aggregate temporal modalities; it has been defined based on a field study on the use of specification patterns in the context of the provisioning of service-based applications. We apply bounded satisf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006